A New Connected Word Recognition Using Synergic Hmm and Dtw
نویسندگان
چکیده
Connected Word Recognition (CWR) is used in many applications such as voice-dialing telephone, automatic data entry, automated banking systems and, etc. This paper presents a novel architecture for CWR based on synergic Hidden Markov Model (HMM) and Dynamic Time Warping (DTW). At first, the proposed architecture eliminates obvious silent times from inputted speech utterance by preprocessing operations. Then, in order to determine boundaries of the existing words in the compressed utterance, a set of candidates for boundary of each word is computed by using the existing capability of the HMM model. Finally, recognition operation is performed by using the synergic between HMM and DTW methods. The architecture has been compared with TLDP method from recognition accuracy and time complexity viewpoints. The evaluation results show that the proposed method significantly improves recognition accuracy and recognition time in comparison with the TLDP method.
منابع مشابه
Isolated Words Recognition System Based on Hybrid Approach DTW/GHMM
In this paper, we present a new hybrid approach for isolated spoken word recognition using Hidden Markov Model models (HMM) combined with Dynamic time warping (DTW). HMM have been shown to be robust in spoken recognition systems. We propose to extend the HMM method by combining it with the DTW algorithm in order to combine the advantages of these two powerful pattern recognition technique. In t...
متن کاملHidden Markov models and selectively trained neural networks for connected confusable word recognition
This paper presents a new method for connected-word recognition with confusable vocabularies, such as connected letters. The recognition process is performed in two steps. First, a second-order HMM provides N-best word strings. Then, the strings of confusable letters are discriminated by a procedure based on acoustic knowledge and artificial neural networks (ANN). This method has been tested on...
متن کاملSpeech Recognition as a Retrieval Problem
Common approaches to automatic speech recognition (ASR) are based on training statistical models for the acoustics of speech. In our work, a retrieval-based ASR system is developed that does not rely on training and thus provides more flexible application. It is based on a set of known reference word utterances for each possibly occurring word in a test string. A test word string is identified ...
متن کاملSpeech recognition based on estimation of mutual information
This paper proposed a pattern matching algorithm based on estimation of mutual information for speech recognition. The preliminary experiments on connected Chinese digits recognition show 97% of test digits were recognized correctly with 4 times much less time consume than DTW or HMM, and it was 6% higher than which gotten by conventional DTW with same experiments data and condition. According ...
متن کاملA New Fast and Efficient HMM-Based Face Recognition System Using a 7-State HMM Along With SVD Coefficients
In this paper, a new Hidden Markov Model (HMM)-based face recognition system is proposed. As a novel point despite of five-state HMM used in pervious researches, we used 7-state HMM to cover more details. Indeed we add two new face regions, eyebrows and chin, to the model. As another novel point, we used a small number of quantized Singular Values Decomposition (SVD) coefficients as feature...
متن کامل